A Modified Harmony Search Algorithm for the Economic Dispatch Problem
نویسندگان
چکیده
منابع مشابه
Harmony Search Algorithm to solve Dynamic Economic Environmental Dispatch ( DEED )
This paper presents an application of Harmony Search algorithm (HSA) to solve the Dynamic Economic-Environmental Dispatch (DEED) problem under some equality and inequality constraints. The equality constraints reflect a real power balance, and the inequality constraint reflects the limits of real generation. The voltage levels and security are assumed to be constant. Dynamic Economic-Environmen...
متن کاملEconomic Load Dispatch Using Population-Variance Harmony Search Algorithm
Economic Load Dispatch Using Population-Variance Harmony Search Algorithm B K Panigrahi, V Ravikumar Pandi, Swagatam Das, Zhihua Cui, Renu Sharma Department of Electrical Engg., IIT, Delhi, India – 110016. Department of Electronics and Telecommunication Engg., Jadavpur University, Kolkata, India. Complex System and Computational Intelligence Laboratory, Taiyuan University of Science and Technol...
متن کاملA Memetic Backtracking Search Optimization Algorithm for Economic Dispatch Problem
Economic load dispatch (ELD) is a non-linear optimization problem for determining the power shared among the generating units to satisfy the generation limit constraints of each unit and minimizing the cost of power production. In this paper, we present a new hybrid algorithm by combing the standard backtracking search optimization algorithm (BSA) and the random wake with direction exploitation...
متن کاملEconomic Load Dispatch Using Improved Harmony Search
This paper presents the use of the improved harmony search method for solving economic load dispatch problems. The harmony search method mimics a jazz improvisation process by musicians in order to seek a fantastic state of harmony. To assess the searching performance of the proposed method, a six-unit thermal generating system acquired from the standard IEEE 30-bus test system was challenged. ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in Informatics and Control
سال: 2014
ISSN: 1220-1766,1841-429X
DOI: 10.24846/v23i2y201402